Optimal Routing to Parallel Heterogeneous Servers- Small Arrival Rates
ثبت نشده
چکیده
Abstmct-Consider a set of k( 22) heterogeneous and exponential servers which operate in parallel. Customers arrive into a single infinite capacity buffer according to a Poisson process, and are routed to available servers in accordance with some routing policy. We show that for arrival rates in some positive interval (0, XO], every routing policy which minimizes the long-run expected holding cost is contained in the set of routing policies that minimize the expected flow time for a system with fixed initial population and no new arrivals.
منابع مشابه
Asymptotic Optimality of Balanced Routing
Consider a system with K parallel single-servers, each with its own waiting room. Upon arrival, a job is to be routed to the queue of one of the servers. Finding routing policy that minimizes the total workload in the system is a known difficult problem in general. Even if the optimal policy is identified, the policy would require the full queue length information at the arrival of each job; fo...
متن کاملOptimal Routing of Fixed Size Jobs to Two Parallel Servers
We consider a heterogeneous two-server system processing fixed size jobs. This includes the scheduling system, where jobs wait in a common queue, and the dispatching system, where jobs are assigned to server-specific queues upon arrival. The optimal policy with respect to the delay in both systems is a threshold policy characterized by a single parameter. In this special case, the scheduling an...
متن کاملState Dependent Multi channel Queuing System with Ordered Entry
In the present study, we analyze the multi-channel service system with ordered entryfrom finite-source and finite-storage at each channel. The arrival and service rates are assumedto be state dependent. The steady state probabilities of the system are obtained by usingChapmann-Kolmogorov equations. Some other performance indices viz. utilization of servers,expected number of units in the system...
متن کاملOptimal Routing to Two Parallel Heterogeneous Servers with Resequencing
Customers arrive to a single service queue according to a Poisson process with rate l, from which they are routed to two parallel heterogeneous and exponential servers whose ra.tes are 1'1 > #2· Customers are released from the system after service completion, according to their arrival order a requirement introducing additional resequencing delays. Customers which are delayed due to resequencin...
متن کاملBlind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers
In a call center, arriving customers must be routed to available servers, and servers that have just become available must be scheduled to help waiting customers. These dynamic routing and scheduling decisions are very difficult, because customers have different needs and servers have different skill levels. A further complication is that it is preferable that these decisions are made blindly; ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014